منابع مشابه
Maintenance of a Spanning Tree in
Many crucial network tasks such as database maintenance can be eeciently carried out given a tree that spans the network. By maintaining such a spanning tree, rather than constructing it "from-scratch" due to every topology change, one can improve the eeciency of the tree construction, as well as the eeciency of the protocols that use the tree. We present a protocol for this task which has comm...
متن کاملDistributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications and selfstabilizing algorithms provide an elegant way of doing it in fault-prone environments. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages on ...
متن کاملTime Optimal Self-Stabilizing Spanning Tree Algorithms
This thesis presents time-optimal self-stabilizing algorithms for distributed spanning tree computation in asynchronous networks. We present both a randomized algorithm for anonymous networks as well as a deterministic version for ID-based networks. Our protocols are the rst to be time-optimal (i.e. stabilize in time O(diameter)) without any prior knowledge of the network size or diameter. Both...
متن کاملTime Optimal Asynchronous Self-Stabilizing Spanning Tree
This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computinga rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known...
متن کاملCommunication - Optimal Parallel Minimum Spanning Tree AlgorithmsExtended
Lower and upper bounds for nding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the rst non-trivial lower bounds on the communication volume required to solve the MST problem. Let p denote the number of processors, n the number of nodes of the input graph, and m the number of edges of the input graph. We show that in the worst case a tota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2008
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1391289.1391292